Link Prediction Benchmarks

نویسنده

  • Haifeng Qian
چکیده

This document describes two temporal link prediction benchmarks that can be downloaded at [10]. Data, code for evaluation and code for several predictors are included in the packages. Section 1 describes the first benchmark, which is link prediction in coauthorship social networks and is a replication of the experiments in [6]. Performances of several predictors are also presented. Section 2 describes the second benchmark, which is link prediction in Wikipedia. Performances of several predictors are also presented. Section 3 describes formats of data files and commands to run and evaluate predictors.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Link Prediction using Network Embedding based on Global Similarity

Background: The link prediction issue is one of the most widely used problems in complex network analysis. Link prediction requires knowing the background of previous link connections and combining them with available information. The link prediction local approaches with node structure objectives are fast in case of speed but are not accurate enough. On the other hand, the global link predicti...

متن کامل

A Link Prediction Method Based on Learning Automata in Social Networks

Nowadays, online social networks are considered as one of the most important emerging phenomena of human societies. In these networks, prediction of link by relying on the knowledge existing of the interaction between network actors provides an estimation of the probability of creation of a new relationship in future. A wide range of applications can be found for link prediction such as electro...

متن کامل

Complex Embeddings for Simple Link Prediction

In statistical relational learning, the link prediction problem is key to automatically understand the structure of large knowledge bases. As in previous studies, we propose to solve this problem through latent factorization. However, here we make use of complex valued embeddings. The composition of complex embeddings can handle a large variety of binary relations, among them symmetric and anti...

متن کامل

Storage Efficient Hardware Prefetching using Delta-Correlating Prediction Tables

This paper presents a novel prefetching heuristic called Delta Correlating Prediction Tables (DCPT). DCPT builds upon two previously proposed techniques, RPT prefetching by Chen and Baer and PC/DC prefetching by Nesbit and Smith. It combines the storageefficient table based design of Reference Prediction Tables (RPT) with the high performance delta correlating design of PC/DC. DCPT substantiall...

متن کامل

Performance Prediction for Simple CPU and Network Sharing

Performance of virtually all parallel and distributed applications deteriorates when a CPU or a communication link has to be shared, but the extent of the slowdown is application dependent. In our experiments with the NAS benchmarks, the slowdown due to congestion on a single link varied from negligible to 120 percent. Estimation of performance of an application under given network conditions i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016